[20251215] BOJ / G5 / 여러분의 다리가 되어드리겠습니다! / 강신지 #1682
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/17352
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
n개의 섬이 있고 각 섬을 연결하는 다리는 n-2개뿐이다.
모든 섬이 연결되도록 다리 하나를 추가할 때, 연결할 두 섬을 출력하라.
🔍 풀이 방법
유니온파인드 썼습니다.
n-2개 다리가 놓인대로 union하면 모든 섬이 연결되기에 다리 한개가 부족하므로 두 그룹으로 나뉨.
1번 섬의 루트와 다른 루트를 가진 섬 i를 찾아 출력.
⏳ 회고